ALGORITHMIC AND TECHNICAL IMPROVEMENTS: OPTIMAL SOLUTIONS TO THE (GENERALIZED) MULTI-WEBER PROBLEM
نویسندگان
چکیده
منابع مشابه
Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty
In this paper, we consider the multi-facility Weber location problem (MFWP) with uncertain location of demand points and transportation cost parameters. Equivalent formulations of its robust counterparts for both the Euclidean and block norms and interval and ellipsoidal uncertainty sets are given as conic linear optimization problems. 2014 Elsevier Inc. All rights reserved.
متن کاملNear-optimal solutions for the generalized max-controlled set problem
In this work we deal with sandwich graphs G=(V,E) and present the notion of vertices f-controlled by a subset MDV . We introduce the generalized max-controlled set problem (GMCSP), where minimum gaps (defined by function f) and positive weights are associated to each vertex of V. In this case, the objective is to find a sandwich graph G in order to maximize the sum of the weights associated to ...
متن کاملRandom Search Algorithm for the Generalized Weber Problem
In this paper, we consider the planar multi-facility Weber problem with restricted zones and non-Euclidean distances, propose an algorithm based on the probability changing method (special kind of genetic algorithms) and prove its efficiency for approximate solving this problem by replacing the continuous coordinate values by discrete ones. Version of the algorithm for multiprocessor systems is...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملImprovements and Comparison of Heuristics for Solving the Multisource Weber Problem
The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane in order to minimize the total transportation cost for satisfying the demand of n xed users, each supplied from its closest facility. Many heuristics have been proposed for this problem, as well as a few exact algorithms. Heuristics are needed to solve quickly large problems and to provide good initial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Papers in Regional Science
سال: 2005
ISSN: 1056-8190,1435-5957
DOI: 10.1111/j.1435-5597.1992.tb01850.x